Approximating Planar Conformal Maps Using Regular Polygonal Meshes

Continuous conformalmaps are typically approximated numerically using a trianglemeshwhich discretizes the plane. Computing a conformal map subject to user-provided constraints then reduces to a sparse linear system, minimizing a quadratic ‘conformal energy’.We address themore general case of non-triangular elements, and provide a complete analysis of the casewhere the plane is discretized using a mesh of regular polygons, e.g. equilateral triangles, squares and hexagons, whose interiors are mapped using barycentric coordinate functions. We demonstrate experimentally that faster convergence to continuous conformal maps may be obtained this way. We provide a formulation of the problem and its solution using complex number algebra, significantly simplifying the notation. We examine a number of common barycentric coordinate functions and demonstrate that superior approximation to harmonic coordinates of a polygon are achieved by the Moving Least Squares coordinates. We also provide a simple iterative algorithm to invert barycentric maps of regular polygon meshes, allowing to apply them in practical applications, e.g. for texture mapping.